The use of a strategy language for solving search problems
Identifieur interne : 009E09 ( Main/Exploration ); précédent : 009E08; suivant : 009E10The use of a strategy language for solving search problems
Auteurs : Carlos Castro [Chili] ; Peter Borovansk [Slovaquie]Source :
- Annals of Mathematics and Artificial Intelligence [ 1012-2443 ] ; 2000-02-01.
English descriptors
Abstract
Abstract: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.
Url:
DOI: 10.1023/A:1018900617693
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002692
- to stream Istex, to step Curation: 002659
- to stream Istex, to step Checkpoint: 002062
- to stream Main, to step Merge: 00A390
- to stream Main, to step Curation: 009E09
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The use of a strategy language for solving search problems</title><author><name sortKey="Castro, Carlos" sort="Castro, Carlos" uniqKey="Castro C" first="Carlos" last="Castro">Carlos Castro</name></author><author><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A4BAF2583F6A5608EE0C43A6B3AC845815D67801</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1023/A:1018900617693</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-8H490384-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002692</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002692</idno><idno type="wicri:Area/Istex/Curation">002659</idno><idno type="wicri:Area/Istex/Checkpoint">002062</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002062</idno><idno type="wicri:doubleKey">1012-2443:2000:Castro C:the:use:of</idno><idno type="wicri:Area/Main/Merge">00A390</idno><idno type="wicri:Area/Main/Curation">009E09</idno><idno type="wicri:Area/Main/Exploration">009E09</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The use of a strategy language for solving search problems</title><author><name sortKey="Castro, Carlos" sort="Castro, Carlos" uniqKey="Castro C" first="Carlos" last="Castro">Carlos Castro</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Chili</country></affiliation></author><author><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Slovaquie</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Annals of Mathematics and Artificial Intelligence</title><title level="j" type="abbrev">Annals of Mathematics and Artificial Intelligence</title><idno type="ISSN">1012-2443</idno><idno type="eISSN">1573-7470</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2000-02-01">2000-02-01</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">1-4</biblScope><biblScope unit="page" from="35">35</biblScope><biblScope unit="page" to="64">64</biblScope></imprint><idno type="ISSN">1012-2443</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1012-2443</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>computational systems</term><term>constraint satisfaction problems</term><term>rewriting logic</term><term>strategies</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.</div></front></TEI><affiliations><list><country><li>Chili</li><li>Slovaquie</li></country></list><tree><country name="Chili"><noRegion><name sortKey="Castro, Carlos" sort="Castro, Carlos" uniqKey="Castro C" first="Carlos" last="Castro">Carlos Castro</name></noRegion></country><country name="Slovaquie"><noRegion><name sortKey="Borovansk, Peter" sort="Borovansk, Peter" uniqKey="Borovansk P" first="Peter" last="Borovansk">Peter Borovansk</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009E09 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009E09 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A4BAF2583F6A5608EE0C43A6B3AC845815D67801
|texte= The use of a strategy language for solving search problems
}}
| This area was generated with Dilib version V0.6.33. |  |